"Bloom filter" meaning in English

{
  "etymology_text": "Conceived by Burton Howard Bloom in 1970.",
  "forms": [
    {
      "form": "Bloom filters",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Bloom filter (plural Bloom filters)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "langcode": "en",
          "name": "Theory of computing",
          "orig": "en:Theory of computing",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              2,
              14
            ]
          ],
          "ref": "2008, Bryan O'Sullivan, John Goerzen, Donald Bruce Stewart, Real World Haskell: Code You Can Believe In, O'Reilly Media, →ISBN, page 581:",
          "text": "A Bloom filter is a set-like data structure that is highly efficient in its use of space. It supports two operations only: insertion and membership querying.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
      ],
      "id": "en-Bloom_filter-en-noun-2KUQu-Rm",
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "element",
          "element"
        ],
        [
          "set",
          "set"
        ],
        [
          "False positive",
          "false positive"
        ],
        [
          "false negative",
          "false negative"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-Bloom filter.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav.ogg"
    }
  ],
  "word": "Bloom filter"
}

{
  "etymology_text": "Conceived by Burton Howard Bloom in 1970.",
  "forms": [
    {
      "form": "Bloom filters",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "Bloom filter (plural Bloom filters)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English eponyms",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Theory of computing"
      ],
      "examples": [
        {
          "bold_text_offsets": [
            [
              2,
              14
            ]
          ],
          "ref": "2008, Bryan O'Sullivan, John Goerzen, Donald Bruce Stewart, Real World Haskell: Code You Can Believe In, O'Reilly Media, →ISBN, page 581:",
          "text": "A Bloom filter is a set-like data structure that is highly efficient in its use of space. It supports two operations only: insertion and membership querying.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
      ],
      "links": [
        [
          "computing",
          "computing#Noun"
        ],
        [
          "theory",
          "theory"
        ],
        [
          "probabilistic",
          "probabilistic"
        ],
        [
          "data structure",
          "data structure"
        ],
        [
          "element",
          "element"
        ],
        [
          "set",
          "set"
        ],
        [
          "False positive",
          "false positive"
        ],
        [
          "false negative",
          "false negative"
        ]
      ],
      "raw_glosses": [
        "(computing theory) A space-efficient probabilistic data structure that is used to test whether an element is a member of a set. False positive matches are possible, but false negatives are not."
      ],
      "topics": [
        "computing",
        "computing-theory",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "sciences"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Naomi Persephone Amethyst (NaomiAmethyst)-Bloom filter.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/a3/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav/LL-Q1860_%28eng%29-Naomi_Persephone_Amethyst_%28NaomiAmethyst%29-Bloom_filter.wav.ogg"
    }
  ],
  "word": "Bloom filter"
}